Exchangeable Equilibria, Part I: Symmetric Bimatrix Games
نویسندگان
چکیده
We introduce the notion of exchangeable equilibria of a symmetric bimatrix game, defined as those correlated equilibria in which players’ strategy choices are conditionally independently and identically distributed given some hidden variable. The set of these equilibria is convex and lies between the symmetric Nash equilibria and the symmetric correlated equilibria. The notion of exchangeable equilibria admits several natural game-theoretic interpretations which emphasize their high degree of symmetry and suggest why they may be focal.
منابع مشابه
Geometry and equilibria in bimatrix games
This thesis studies the application of geometric concepts and methods in the analysis of strategic-form games, in particular bimatrix games. Our focus is on three geometric concepts: the index, geometric algorithms for the computation of Nash equilibria, and polytopes. The contribution of this thesis consists of three parts. First, we present an algorithm for the computation of the index in deg...
متن کاملZero-Sum Game Techniques for Approximate Nash Equilibria
We apply existing, and develop new, zero-sum game techniques for designing polynomial-time algorithms to compute additive approximate Nash equilibria in bimatrix games. In particular, we give a polynomial-time algorithm that given an arbitrary bimatrix game as an input, outputs either an additive 1 3 -Nash equilibrium or an additive 1 2 -well-supported Nash equilibrium; and we give a polynomial...
متن کاملExchangeable equilibria
The main contribution of this thesis is a new solution concept for symmetric games (of complete information in strategic form), the exchangeable equilibrium. This is an intermediate notion between symmetric Nash and symmetric correlated equilibrium. While a variety of weaker solution concepts than correlated equilibrium and a variety of refinements of Nash equilibrium are known, there is little...
متن کاملNash Equilibrium Computation in Various Games
Non-cooperative Game Theory provides a framework to analyze the strategic interactions of selfish agents in any given organization. In a pioneering work, John Nash (1951) [49] proved that in any such (finite) organization, there exists a steady state where no agent benefits by unilateral deviation, henceforth called Nash equilibrium (NE). Nash equilibrium is perhaps the most well known and well...
متن کاملFe b 20 09 Is having a unique equilibrium robust ?
We investigate whether having a unique equilibrium (or a given number of equilibria) is robust to perturbation of the payoffs, both for Nash equilibrium and correlated equilibrium. We show that the set of n-player finite games with a unique correlated equilibrium is open, while this is not true of Nash equilibrium for n > 2. The crucial lemma is that a unique correlated equilibrium is a quasi-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1307.3586 شماره
صفحات -
تاریخ انتشار 2013